https://ogma.newcastle.edu.au/vital/access/ /manager/Index en-au 5 https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:25862 Wed 25 Jan 2017 12:06:39 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:16283 Sat 24 Mar 2018 07:59:26 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21225 k-nearest neighbor (kNN) structure can provide an efficient solution to this problem. Only a few attempts were found in the literature that focus on solving the problem using the kNNs. This paper briefs the state-of-the-art strategies for the MST problem and a fast and scalable solution combining the classical Borůvka’s MST algorithm and the kNN graph structure. The proposed algorithm is implemented for CUDA enabled GPUs (kNN-Borůvka-GPU), but the basic approach is simple and adaptable to other available architectures. Speed-ups of 30-40 times compared with CPU implementation was observed for several large-scale synthetic and real world data sets.]]> Sat 24 Mar 2018 07:53:01 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:18528 Sat 24 Mar 2018 07:50:20 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:26041 Sat 24 Mar 2018 07:26:27 AEDT ]]> https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:33237 Fri 14 Sep 2018 16:33:09 AEST ]]>